Resampling Methods for Checking Models and Statistical Hypotheses
نویسندگان
چکیده
Permutation tests: conditional limit theorems and multivariate applications Helmut Strasser (Wien) In this talk limit theorems for the conditional distributions of linear test statistics are presented. The assertions are conditioned on the sigma-field of permutation symmetric sets. The limit theorems are concerned both with the conditional distributions under the hypothesis of randomness and under general contiguous alternatives with independent but not identically distributed observations. The proofs are based on results on limit theorems for exchangeable random variables. The limit theorems under contiguous alternatives are consequences of a LAN-result for likelihood ratios of symmetrized product measures. The results have implications for statistical applications. By example it is shown that minimum variance partitions which are defined by observed data (e.g. by LVQ) lead to asymptotically optimal adaptive tests for the k-sample problem. Decision-theoretic properties of partitioned sample spaces Klaus Pötzelberger (Wien) Let E = (Ω,F , (Pt)t∈T ) denote an experiment. The complexity of the experiment may be reduced by replacing F by a finite field F̃ ⊆ F , which leads to the experiment F = (Ω, F̃ , (Pt)t∈T ). F̃ is identified with a finite partition B = (B1, . . . , Bm) of Ω. A reduced experiment which is maximal with respect to the information semiorder on the set of all reduced experiments with the size of the corresponding partition being at most m is called admissible. We give characterizations of admissible experiments and of the corresponding field F̃ . The problem of characterizing admissible subfields is directly connected with the following problem. Let P be a Borel probability measure on a suitable Banach space ( IR|T | if T is finite). Characterize the maximal elements μ ∈M(P,m) with respect to the Bishop-De Leeuw order , where μ ∈M(P,m) if and only if μ P and |supp(μ)| ≤ m. The results are relevant for procedures based on a data-driven partition of the sample space. Statistical challenges in survival and event history analysis: complicated sampling frames and summary statistics Niels Keiding (Kobenhavn) This talk presented a series of examples of survival and event history analysis under complicated sampling frames, all initiated by taking a cross-sectional sample through a population subject to morbidity and mortality in calendar time. I also gave an introduction to current work (lead by P.K.Andersen in our department) using regression analysis of pseudo-observations (known from jackknife methodology) to obtain regression models for secondary summary measures such as transition probabilities in multi-state models. The complicated sampling frames were all illustrated by Lexis diagrams. Three examples concerning incidence were given: incidence estimation from current status data retrospective incidence estimation using inverse probability weighted estimates based on independent survival information
منابع مشابه
روشهای بازنمونهگیری بوت استرپ و جک نایف در تحلیل بقای بیماران مبتلا به تالاسمی ماژور
Background and Objectives: A small sample size can influence the results of statistical analysis. A reduction in the sample size may happen due to different reasons, such as loss of information, i.e. existing missing value in some variables. This study aimed to apply bootstrap and jackknife resampling methods in survival analysis of thalassemia major patients. Methods: In this historical coh...
متن کاملTesting Theories with Big Data: A Super-Power Approach
In the early days of IS research, a large sample was over 100 records. In today's Big Data era, papers routinely report many thousands, and even millions of records. Large samples provide a powerful tool for testing hypotheses. Applying small-sample modeling to large samples not only wastes the "super-power" advantages but can also lead to incorrect and misleading conclusions. In particular, it...
متن کاملFast and robust bootstrap
In this paper we review recent developments on a bootstrap method for robust estimators which is computationally faster and more resistant to outliers than the classical bootstrap. This fast and robust bootstrap method is, under reasonable regularity conditions, asymptotically consistent. We describe the method in general and then consider its application to perform inference based on robust es...
متن کاملCredit Card Fraud Detection using Data mining and Statistical Methods
Due to today’s advancement in technology and businesses, fraud detection has become a critical component of financial transactions. Considering vast amounts of data in large datasets, it becomes more difficult to detect fraud transactions manually. In this research, we propose a combined method using both data mining and statistical tasks, utilizing feature selection, resampling and cost-...
متن کاملGeneralized Linear Models: Checking Assumptions and Strengthening Conclusions
Key assumptions that underlie the application of standard generalized linear models (GLMs) include the statistical independence of the observations, the correct speci cation of the link and variance functions, the correct scale for measurement of the explanatory variables and the lack of undue in uence of individual observations on the tted model.. Using data on counts of epileptic seizures bef...
متن کاملAn Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods
Classification methods from statistical pattern recognition, neural nets, and machine learning were applied to four real-world data sets. Each of these data sets has been previously analyzed and reported in the statistical, medical, or machine learning literature. The data sets are characterized by statisucal uncertainty; there is no completely accurate solution to these problems. Training and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003